Coalition Description Logic with Individuals

نویسندگان

  • Inanç Seylan
  • Wojciech Jamroga
چکیده

Coalition logic (CL) [12] formalizes the ability of groups of agents to achieve certain outcomes in strategic games. The central operator of the logic is [A], with [A]φ meaning that group of agents A has a strategy to achieve an outcome state where φ holds. On the other hand, description logics (DLs) are logical formalisms for representing the knowledge of an application domain in a structured way [2]. More precisely, DLs allow to describe classes, assign individuals to these classes, and define binary relations on individuals. The importance of DLs lies in the fact that they are decidable fragments of first-order logic and they have well developed practical decision procedures. Moreover, they comprise the formal basis of the Semantic Web ontology languages [8]. In [14], we proposed a product style combination of the description logic ALC with coalition logic, that allowed for application of modal operators to both formulas and concepts. Still, the combination kept the agent and the concept layers pretty much separated; in particular, one could not use the first-order elements of DL to specify how agents and their groups can influence themselves. In this paper, we make the first step to overcome the drawback: we extend the language of concepts with names of individuals (including agents), and we allow for more complex terms to define coalitions. This simple extension allows to express surprisingly sophisticated properties, as the examples in Section 2.4 demonstrate. Furthermore, we extend the satisfiability procedure from [14] to handle the new, language, and we establish complexity bounds for the satisfiability problem. It is worth noting that we do not presuppose any general relationship between agents’ first-order properties and their temporal abilities in our logic. In particular, if a formula is satisfiable (resp. valid) then one can replace any occurrence of an agent name in the formula with any other agent name, and the resulting formula will be still satisfiable (resp. valid). Note that this symmetry of agents’ abilities with respect to the actual actor is a general feature of CL, and not specifically of our combination of CL and description logic. On the other hand, agents used in coalitions and agents used as individuals are semantically

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Description logic for coalitions

Coalition Logic (CL) is one of the most important formalisms for specification and verification of game-like multi-agent systems. Several extensions of the logic have been studied in the literature. These extensions are usually fusions (independent joins) of CL with other modal logics (e.g., temporal, epistemic, dynamic, etc.), and they are generally propositional. In this paper, we propose a g...

متن کامل

A Resolution Prover for Coalition Logic

We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolutionb...

متن کامل

Higher-Order Coalition Logic

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is rea...

متن کامل

A Modal Logic for Coalitional Power in Games

We present a modal logic for reasoning about what groups of agents can bring about by collective action. Given a set of states, we introduce game frames which associate with every state a strategic game among the agents. Game frames are essentially extensive games of perfect information with simultaneous actions, where every action profile is associated with a new state, the outcome of the game...

متن کامل

Completeness of Epistemic Coalition Logic with Group Knowledge

Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete axiomatisations has so far been an open problem. In this paper we settle several of those problems. We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 262  شماره 

صفحات  -

تاریخ انتشار 2010